Enhancement of Dijkstra Algorithm for Finding Optimal Path

The Dijkstra algorithm is a common method used when solving shortest path problems. It graph-based that compares node distances, selects the subsequent node, and generates an ideal path. However, it seen struggles with memory utilization, particularly working substantial amounts of data or graphs. purpose this research work to improve tackle current problem. enhancement accomplished by providing approach in which two closest nodes are combined each iteration. With this, conclusion study enhanced algorithm, application combination, was able reduce usage comparison existing algorithm.